Genotypes of irreducible representations of finite p-groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genotypes of irreducible representations of finite p-groups

For any characteristic zero coefficient field, an irreducible representation of a finite p-group can be assigned a Roquette p-group, called the genotype. This has already been done by Bouc and Kronstein in the special cases Q and C. A genetic invariant of an irrep is invariant under group isomorphism, change of coefficient field, Galois conjugation, and under suitable inductions from subquotien...

متن کامل

Computing Irreducible Representations of Finite Groups

We consider the bit-complexity of the problem stated in the title. Exact computations in algebraic number fields are performed symbolically. We present a polynomial-time algorithm to find a complete set of nonequivalent irreducible representations over the field of complex numbers of a finite group given by its multiplication table. In particular, it follows that some representative of each equ...

متن کامل

Irreducible Representations of Finite Spin Groups

In this paper we present a computation (done by the author in 1983) which yields a multiplicity one statement for the irreducible representations of a finite spin group which, in turn, yields the classification of the irreducible representations of a finite spin group. Introduction 0.1. Let G be a connected reductive group defined over a finite field Fq and let F : G → G be the corresponding Fr...

متن کامل

Finite p-groups with few non-linear irreducible character kernels

Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

متن کامل

Computing irreducible representations of supersolvable groups over small finite fields

We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effectiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2006

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2006.05.031